#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

//加法
vector<int> add(vector<int> &A, vector<int> &B) 
{
	vector<int> C;
	int t = 0;
	for(size_t i = 0; i < A.size() || i < B.size() || t; i++){
		if(i < A.size()) t += A[i];
		if(i < B.size()) t += B[i];
		C.push_back(t % 10);
		t /= 10;
	}
	return C;
}
void solve_1()
{
	string a, b;
	cin >> a >> b;
	vector<int> A, B;
	for(int i = a.size() - 1; i >= 0; i--)
		A.push_back(a[i] - '0');
	for(int i = b.size() - 1; i >= 0; i--)
		B.push_back(b[i] - '0');
	
	auto C = add(A, B);
	for(int i = C.size() - 1; i >= 0; i--)
		printf("%d", C[i]);
	return;
}
//减法
bool cmp(vector<int> A, vector<int> B)
{
	if(A.size() != B.size()) return A.size() > B.size();
	for(int i = A.size() - 1; i >= 0; i--)
		if(A[i] != B[i])
			return A[i] > B[i];
	return true;
}
vector<int> sub(vector<int> &A, vector<int> &B)
{
	vector<int> C;
	int t = 0;
	for(size_t i = 0; i < A.size(); i++){
		t = A[i] - t;
		if(i < B.size()) t -= B[i];
		C.push_back((t + 10) % 10);
		if(t < 0) t = 1;
		else t = 0;
	}
	while(C.size() > 1 && C.back() == 0) C.pop_back(); //去除前导零
	return C;
}
void solve_2()
{
	string a, b;
	cin >> a >> b;
	vector<int> A, B;
	for(int i = a.size() - 1; i >= 0; i--)
		A.push_back(a[i] - '0');
	for(int i = b.size() - 1; i >= 0; i--)
		B.push_back(b[i] - '0');
	if(cmp(A, B)){
		auto C = sub(A, B);
		for(int i = C.size() - 1; i>= 0; i--)
			printf("%d", C[i]);
	}
	else{
		auto C = sub(B, A);
		printf("-");
		for(int i = C.size() - 1; i>= 0; i--)
			printf("%d", C[i]);
	}
	return;
}
//乘法
vector<int> mul(vector<int> &A, int b)
{
	vector<int> C;
	int t = 0;
	for(size_t i = 0; i < A.size() || t; i++){
		if(i < A.size()) t += A[i] * b;
		C.push_back(t % 10);
		t /= 10;
	}
	while(C.size() > 1 && C.back() == 0) C.pop_back(); //去除前导零
	return C;
}
void solve_3()
{
	string a;
	int b;
	cin >> a >> b;
	vector<int> A;
	for(int i = a.size() - 1; i >= 0; i--)
		A.push_back(a[i] - '0');
	auto C = mul(A, b);
	for(int i = C.size() - 1; i >= 0; i--)
		printf("%d", C[i]);
	return;
}
//除法
vector<int> div(vector<int> &A, int b, int &r)
{
	vector<int> C;
	r = 0;
	for(int i = A.size() - 1; i >= 0; i--){
		r = r * 10 + A[i];
		C.push_back(r / b);
		r %= b;
	}
	reverse(C.begin(), C.end());
	while(C.size() > 1 && C.back() == 0) C.pop_back();
	return C;
}
void solve_4()
{
	string a;
	int b;
	cin >> a >> b;
	vector<int> A;
	for(int i = a.size() - 1; i >= 0; i--)
		A.push_back(a[i] - '0');
	int r;
	auto C = div(A, b, r);
	for(int i = C.size() - 1; i >= 0; i--)
		printf("%d", C[i]);
	cout << endl << r << endl;
	return;
}
int main()
{
	//solve_1();
	//solve_2();
	solve_3();
	//solve_1();
	return 0;
}
